Discrete Optimization Model in Constructing Optimal Decision Tree

Decision trees have been well studied and widely used in knowledge discovery decision support systems. One of the applications binary integer programming to form or making is knapsack problem. The problem an that involves only one constraint. generally illustrated with a bag item. be solved maximize price goods certain capacity can loaded by too. In solving problem, it done directly. this paper we are interested show how implicit enumeration method solves optimal tree